Stability-throughput analysis in a multi-hop ad hoc networks with weighted fair queueing

Consider a wireless ad hoc network with random access channel. We present a model that takes into account topology, routing, random access in MAC layer and forwarding probability. We propose a new approach (based on cycle of transmissions) to derive throughput of multi-hop routes and stability of forwarding queues. With this cycle approach, we correct the analytical expressions derived in [2] and discover that their results are valid only in particular cases such as symmetric networks. However, in this paper, we get extended results for general network case. Moreover, we confirm that (i) the forwarding queues in a system of weighted fair queues has a special property and (ii) the end to end throughput of a connection does not depend on the load of the intermediate forwarding queues between a source and a destination. We perform extensive simulations and verify that the analytical results exactly match the results obtained from simulations.